Unidirectional and parallel Baum-Welch algorithms

Hidden Markov models (HMM’s) are popular in many applications, such as automatic speech recognition, control theory, biology, communication theory over channels with bursts of errors, queueing theory, and many others. Therefore, it is important to have robust and fast methods for fitting HMM’s to experimental data (training). Standard statistical methods of maximum likelihood parameter estimation (such as Newton–Raphson, conjugate gradients, etc.) are not robust and difficult to use for fitting HMM’s with many parameters. On the other hand, the Baum–Welch algorithm is robust, but slow. In this paper, we present a parallel version of the Baum–Welch algorithm. We consider also unidirectional procedures which, in contrast with the well-known forward-backward algorithm, use the amount of memory that is independent of the observation sequence length.